Semiregularity of congruences implies congruence modularity at 0

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence Modularity Implies Cyclic Terms for Finite Algebras

An n-ary operation f : An → A is called cyclic, if it is idempotent and f(a1, a2, a3, . . . , an) = f(a2, a3, . . . , an, a1) for every a1, . . . , an ∈ A. We prove that every finite algebra A in a congruence modular variety has a p-ary cyclic term operation for any prime p greater than |A|.

متن کامل

Congruence ABC implies ABC

The ABC conjecture of Masser and Oesterlé states that if (a, b, c) are coprime integers with a+ b+ c = 0, then sup(|a|, |b|, |c|) < cǫ(rad(abc)) 1+ǫ for any ǫ > 0. In [2], Oesterlé observes that if the ABC conjecture holds for all (a, b, c) with 16|abc, then the full ABC conjecture holds. We extend that result to show that, for every integer N , the “congruence ABC conjecture” that ABC holds fo...

متن کامل

Congruence for Structural Congruences

Structural congruences have been used to define the semantics and to capture inherent properties of language constructs. They have been used as an addendum to transition system specifications in Plotkin’s style of Structural Operational Semantics (SOS). However, there has been little theoretical work on establishing a formal link between these two semantic specification frameworks. In this pape...

متن کامل

Weak Congruence Identities at 0

The aim of the paper is to investigate some local properties of the weak congruence lattice of an algebra, which is supposed to possess the constant 0, or a nullary term operation. Lattice identities are restricted to the zero blocks of weak congruences. In this way, a local version of the CEP, and local modularity and distributivity of the weak congruence lattices are characterized. In additio...

متن کامل

Congruence Distributivity Implies Bounded Width

We show that a constraint language with compatible Jónnson terms (i.e. associated with an algebra generating a congruence distributive variety) defines a Constraint Satisfaction Problem solvable by the local consistency checking algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 2002

ISSN: 0011-4642,1572-9141

DOI: 10.1023/a:1021778612235